美国的意识形态分裂在日常交流中变得越来越突出。因此，关于政治两极分化的许多研究，包括最近采取计算观点的许多努力。通过检测文本语料库中的政治偏见，可以尝试描述和辨别该文本的两极分性。从直觉上讲，命名的实体（即，用作名词的名词和短语）和文本中的标签经常带有有关政治观点的信息。例如，使用“支持选择”一词的人可能是自由的，而使用“亲生生命”一词的人可能是保守的。在本文中，我们试图揭示社交媒体文本数据中的政治极性，并通过将极性得分分配给实体和标签来量化这些极性。尽管这个想法很简单，但很难以可信赖的定量方式进行这种推论。关键挑战包括少数已知标签，连续的政治观点，以及在嵌入单词媒介中的极性得分和极性中性语义含义的保存。为了克服这些挑战，我们提出了极性感知的嵌入多任务学习（PEM）模型。该模型包括（1）自制的上下文保护任务，（2）基于注意力的推文级别的极性推导任务，以及（3）对抗性学习任务，可促进嵌入式的极性维度及其语义之间的独立性方面。我们的实验结果表明，我们的PEM模型可以成功学习极性感知的嵌入。我们检查了各种应用，从而证明了PEM模型的有效性。我们还讨论了我们的工作的重要局限性，并在将PEM模型应用于现实世界情景时的压力谨慎。

在本文中，我们通过查看RGBD图像以及有关配对问题和答案的推理来解决3D概念接地（即细分和学习视觉概念）的挑战性问题。现有的视觉推理方法通常利用监督的方法来提取概念接地的2D分割面具。相比之下，人类能够将图像的基础3D表示基础。但是，传统上推断出的3D表示（例如，点云，体素格林和网格）无法灵活地捕获连续的3D特征，从而使基于所指对象的语言描述对3D区域的地面概念充满挑战。为了解决这两个问题，我们建议利用神经领域的连续，可区分的性质来细分和学习概念。具体而言，场景中的每个3D坐标都表示为高维描述符。然后，可以通过计算3D坐标的描述符向量与语言概念的向量嵌入之间的相似性来执行概念接地，这使得能够以不同的方式在神经领域中共同学习分割和概念。结果，3D语义和实例分割都可以直接通过使用神经场顶上的一组定义的神经操作员来回答监督（例如，过滤和计数）。实验结果表明，我们提出的框架优于语义和实例细分任务上的无监督/语言介导的分割模型，并且在具有挑战性的3D意识到的视觉推理任务上优于现有模型。此外，我们的框架可以很好地概括为看不见的形状类别和真正的扫描。

人类视觉感知的关键方面是能够将视觉场景分解为单个对象并进一步进入对象部分，形成部分整个层次结构。这种复合结构可以诱导丰富的语义概念和关系，从而在视觉信号的解释和组织中发挥着重要作用，以及视觉感知和推理的概括。但是，现有的视觉推理基准主要专注于物体而不是零件。基于完整的部分整个层次结构的视觉推理比以前粒度概念，更丰富的几何关系和更复杂的物理学所致的对象的推理更具挑战性。因此，为了更好地为基于部分的概念，关系和物理推理服务，我们介绍了一个名为PTR的新型大规模诊断视觉推理数据集。 PTR包含大约70k RGBD合成图像，具有地面真理对象和有关语义实例分段，颜色属性，空间和几何关系的部分级别注释，以及诸如稳定性的某些物理性质。这些图像与700K机生成的问题配对，涵盖各种类型的推理类型，使其成为视觉推理模型的良好测试平台。我们在这个数据集上检查了几种最先进的视觉推理模型，并观察到他们在人类可以容易地推断正确答案的情况下仍然存在许多令人惊讶的错误。我们认为，此数据集将开辟基于零件推理的新机会。

受到人类掌握算术和普遍不见问题的非凡能力的启发，我们提出了一个新的数据集，提示，以研究机器在三个层面上学习可推广概念的能力：感知，语法和语义。学习代理人是从图像（即感知）等原始信号中观察到的概念，如何在结构上组合多个概念来形成有效的表达（即语法），以及如何实现概念以提供各种推理任务（即语义学），都是以弱监督的方式。以系统的概括为重点，我们仔细设计了一个五倍的测试集，以评估插值和推断学概念W.R.T.这三个级别。我们进一步设计了一些学习的分割，以测试模型是否可以快速学习新概念并将其推广到更复杂的场景。为了了解现有模型的局限性，我们通过包括RNN，Transformers和GPT-3在内的各种顺序到序列模型（以及思想提示链）进行了广泛的实验。结果表明，当前的模型仍在推断出远程句法依赖性和语义方面仍在努力。当在几次设置中使用新概念测试时，模型显示出对人级概括的显着差距。此外，我们发现通过简单地扩大数据集和模型大小来解决提示是不可行的。该策略几乎没有帮助推断语法和语义。最后，在零拍的GPT-3实验中，思想链提示链显示出令人印象深刻的结果，并显着提高了测试准确性。我们认为，拟议的数据集以及实验发现在系统概括方面引起了极大的兴趣。

Existing federated classification algorithms typically assume the local annotations at every client cover the same set of classes. In this paper, we aim to lift such an assumption and focus on a more general yet practical non-IID setting where every client can work on non-identical and even disjoint sets of classes (i.e., client-exclusive classes), and the clients have a common goal which is to build a global classification model to identify the union of these classes. Such heterogeneity in client class sets poses a new challenge: how to ensure different clients are operating in the same latent space so as to avoid the drift after aggregation? We observe that the classes can be described in natural languages (i.e., class names) and these names are typically safe to share with all parties. Thus, we formulate the classification problem as a matching process between data representations and class representations and break the classification model into a data encoder and a label encoder. We leverage the natural-language class names as the common ground to anchor the class representations in the label encoder. In each iteration, the label encoder updates the class representations and regulates the data representations through matching. We further use the updated class representations at each round to annotate data samples for locally-unaware classes according to similarity and distill knowledge to local models. Extensive experiments on four real-world datasets show that the proposed method can outperform various classical and state-of-the-art federated learning methods designed for learning with non-IID data.

In this paper, a semantic communication framework for image transmission is developed. In the investigated framework, a set of servers cooperatively transmit images to a set of users utilizing semantic communication techniques. To evaluate the performance of studied semantic communication system, a multimodal metric is proposed to measure the correlation between the extracted semantic information and the original image. To meet the ISS requirement of each user, each server must jointly determine the semantic information to be transmitted and the resource blocks (RBs) used for semantic information transmission. We formulate this problem as an optimization problem aiming to minimize each server's transmission latency while reaching the ISS requirement. To solve this problem, a value decomposition based entropy-maximized multi-agent reinforcement learning (RL) is proposed, which enables servers to coordinate for training and execute RB allocation in a distributed manner to approach to a globally optimal performance with less training iterations. Compared to traditional multi-agent RL, the proposed RL improves the valuable action exploration of servers and the probability of finding a globally optimal RB allocation policy based on local observation. Simulation results show that the proposed algorithm can reduce the transmission delay by up to 16.1% compared to traditional multi-agent RL.

This is paper for the smooth function approximation by neural networks (NN). Mathematical or physical functions can be replaced by NN models through regression. In this study, we get NNs that generate highly accurate and highly smooth function, which only comprised of a few weight parameters, through discussing a few topics about regression. First, we reinterpret inside of NNs for regression; consequently, we propose a new activation function--integrated sigmoid linear unit (ISLU). Then special charateristics of metadata for regression, which is different from other data like image or sound, is discussed for improving the performance of neural networks. Finally, the one of a simple hierarchical NN that generate models substituting mathematical function is presented, and the new batch concept ``meta-batch" which improves the performance of NN several times more is introduced. The new activation function, meta-batch method, features of numerical data, meta-augmentation with metaparameters, and a structure of NN generating a compact multi-layer perceptron(MLP) are essential in this study.

Detecting abrupt changes in data distribution is one of the most significant tasks in streaming data analysis. Although many unsupervised Change-Point Detection (CPD) methods have been proposed recently to identify those changes, they still suffer from missing subtle changes, poor scalability, or/and sensitive to noise points. To meet these challenges, we are the first to generalise the CPD problem as a special case of the Change-Interval Detection (CID) problem. Then we propose a CID method, named iCID, based on a recent Isolation Distributional Kernel (IDK). iCID identifies the change interval if there is a high dissimilarity score between two non-homogeneous temporal adjacent intervals. The data-dependent property and finite feature map of IDK enabled iCID to efficiently identify various types of change points in data streams with the tolerance of noise points. Moreover, the proposed online and offline versions of iCID have the ability to optimise key parameter settings. The effectiveness and efficiency of iCID have been systematically verified on both synthetic and real-world datasets.

Time-series anomaly detection is an important task and has been widely applied in the industry. Since manual data annotation is expensive and inefficient, most applications adopt unsupervised anomaly detection methods, but the results are usually sub-optimal and unsatisfactory to end customers. Weak supervision is a promising paradigm for obtaining considerable labels in a low-cost way, which enables the customers to label data by writing heuristic rules rather than annotating each instance individually. However, in the time-series domain, it is hard for people to write reasonable labeling functions as the time-series data is numerically continuous and difficult to be understood. In this paper, we propose a Label-Efficient Interactive Time-Series Anomaly Detection (LEIAD) system, which enables a user to improve the results of unsupervised anomaly detection by performing only a small amount of interactions with the system. To achieve this goal, the system integrates weak supervision and active learning collaboratively while generating labeling functions automatically using only a few labeled data. All of these techniques are complementary and can promote each other in a reinforced manner. We conduct experiments on three time-series anomaly detection datasets, demonstrating that the proposed system is superior to existing solutions in both weak supervision and active learning areas. Also, the system has been tested in a real scenario in industry to show its practicality.

In robotics and computer vision communities, extensive studies have been widely conducted regarding surveillance tasks, including human detection, tracking, and motion recognition with a camera. Additionally, deep learning algorithms are widely utilized in the aforementioned tasks as in other computer vision tasks. Existing public datasets are insufficient to develop learning-based methods that handle various surveillance for outdoor and extreme situations such as harsh weather and low illuminance conditions. Therefore, we introduce a new large-scale outdoor surveillance dataset named eXtremely large-scale Multi-modAl Sensor dataset (X-MAS) containing more than 500,000 image pairs and the first-person view data annotated by well-trained annotators. Moreover, a single pair contains multi-modal data (e.g. an IR image, an RGB image, a thermal image, a depth image, and a LiDAR scan). This is the first large-scale first-person view outdoor multi-modal dataset focusing on surveillance tasks to the best of our knowledge. We present an overview of the proposed dataset with statistics and present methods of exploiting our dataset with deep learning-based algorithms. The latest information on the dataset and our study are available at https://github.com/lge-robot-navi, and the dataset will be available for download through a server.